翻訳と辞書 Words near each other ・ "O" Is for Outlaw ・ "O"-Jung.Ban.Hap. ・ "Ode-to-Napoleon" hexachord ・ "Oh Yeah!" Live ・ "Our Contemporary" regional art exhibition (Leningrad, 1975) ・ "P" Is for Peril ・ "Pimpernel" Smith ・ "Polish death camp" controversy ・ "Pro knigi" ("About books") ・ "Prosopa" Greek Television Awards ・ "Pussy Cats" Starring the Walkmen ・ "Q" Is for Quarry ・ "R" Is for Ricochet ・ "R" The King (2016 film) ・ "Rags" Ragland ・ ! (album) ・ ! (disambiguation) ・ !! ・ !!! ・ !!! (album) ・ !!Destroy-Oh-Boy!! ・ !Action Pact! ・ !Arriba! La Pachanga ・ !Hero ・ !Hero (album) ・ !Kung language ・ !Oka Tokat ・ !PAUS3 ・ !T.O.O.H.! ・ !Women Art Revolution Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク circle packing in a circle ： ウィキペディア英語版 circle packing in a circle Circle packing in a circle is a two-dimensional packing problem with the objective of packing unit circles into the smallest possible larger circle. Minimum solutions (in case several minimal solutions have been shown to exist, only one variant appears in the table):〔(Erich Friedman, ''Circles in Circles'' on Erich's Packing Center )〕 \sqrt ≈ 2.154... | 0.6466... | Trivially optimal. | |- align=center | 4 | $1+\backslash sqrt$ ≈ 2.414... | 0.6864... | Trivially optimal. | |- align=center | 5 | $1+\backslash sqrt\})\}$ ≈ 2.701... | 0.6854... | Trivially optimal. Also proved optimal by Graham in 1968.〔 | |- align=center | 6 | 3 | 0.6667... | Trivially optimal. Also proved optimal by Graham in 1968.〔 | |- align=center | 7 | 3 | 0.7778... | Trivially optimal. | |- align=center | 8 | $1+\backslash frac)\}$ ≈ 3.304... | 0.7328... | Proved optimal by Pirl in 1969.〔 | |- align=center | 9 | $1+\backslash sqrt$ ≈ 3.613... | 0.6895... | Proved optimal by Pirl in 1969.〔 | |- align=center | 10 | 3.813... | 0.6878... | Proved optimal by Pirl in 1969.〔 | |- align=center | 11 | $1+\backslash frac)\}$ ≈ 3.923... | 0.7148... | Proved optimal by Melissen in 1994.〔 | |- align=center | 12 | 4.029... | 0.7392... | Proved optimal by Fodor in 2000.〔 | 120px |- align=center | 13 | $2\; +\; \backslash sqrt$ ≈4.236... | 0.7245... | Proved optimal by Fodor in 2003.〔 | 120x120px 120x120px |- align=center | 14 | 4.328... | 0.7474... | Conjectured optimal.〔 | 120px |- align=center | 15 | $1\; +\; \backslash sqrt\}\; +\; 4\; \backslash sqrt\}\}\}$ ≈ 4.521... | 0.7339... | Conjectured optimal.〔 | 120px |- align=center | 16 | 4.615... | 0.7512... | Conjectured optimal.〔 | 120px |- align=center | 17 | 4.792... | 0.7403... | Conjectured optimal.〔 | 120px |- align=center | 18 | $1+\backslash sqrt+\backslash sqrt$ ≈ 4.863... | 0.7611... | Conjectured optimal.〔 | 120px |- align=center | 19 | $1+\backslash sqrt+\backslash sqrt$ ≈ 4.863... | 0.8034... | Proved optimal by Fodor in 1999.〔 | 120px |- align=center | 20 | 5.122... | 0.7623... | Conjectured optimal.〔 | 120px |} ==See also== *Disk covering problem 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「circle packing in a circle」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.